Reducing latency in wireless networks

ABSTRACT

Techniques for reducing latency between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and reassociating with the common access point. The identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the stations. In an alternative aspect, a terminal station may repeat the disassociation and reassociation procedures without knowledge of the other station&#39;s BSSID, until a measured latency drops below a threshold.

RELATED APPLICATION

This application is a continuation application of U.S. patent application Ser. No. 15/881,798, filed Jan. 28, 2018, which is herein incorporated by reference.

BACKGROUND

A wireless local area network (herein “WLAN”) is a network in which two or more terminal stations (herein “STA's”) wirelessly communicate with each other over a spatially limited area. The IEEE 802.11 Wireless Local Area Network Specifications (herein “802.11”) define a set of protocols for communications between devices in a WLAN. In a mode of operation known as infrastructure mode, a single WLAN includes one or more access points (AP's) acting as hubs for the network. Terminal stations (herein “STA's”) may each access the WLAN by communicating with one of the AP's.

Certain WLAN applications call for two or more STA's connected to a single WLAN to exchange data with each other through the wireless infrastructure, i.e., through one or more AP's. For example, a smartphone may be connected to a wireless display over a WLAN to display content from the smartphone on a larger screen. In this scenario, there will be a latency in communications between the wireless display and the smartphone, due to the time required for the data to travel over the WLAN infrastructure.

It would be desirable to provide simple and efficient techniques to reduce latency in communications between terminal stations in WLAN's operating in infrastructure mode.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 shows a wireless local area network illustrating various aspects of the present disclosure;

FIG. 2 shows a procedure wherein any two intra-network STA's may wireless communicate with each other in infrastructure mode;

FIG. 3 illustrates an exemplary implementation of a method according to the present disclosure;

FIG. 4 shows an exemplary stage during the connection procedure of the method in FIG. 3;

FIG. 5 illustrates an alternative initial WLAN configuration;

FIG. 6 illustrates an alternative exemplary implementation of a method for associating the paired STA's with a third AP functioning as the common AP;

FIG. 7 shows an exemplary configuration of the WLAN following a certain stage of the method in FIG. 6;

FIG. 8 illustrates an alternative exemplary implementation of a method according to the present disclosure;

FIG. 9 illustrates an exemplary implementation of paired STA's associated with a common AP;

FIG. 10 illustrates an exemplary implementation of a method;

FIG. 11 illustrates an exemplary implementation of an apparatus; and

FIG. 12 illustrates an alternative exemplary implementation of an apparatus.

DETAILED DESCRIPTION

Various aspects of the technology described herein are generally directed towards techniques for reducing latency in communications between terminal stations in a wireless local area network. In an aspect, two stations in close proximity may be configured to associate with a common access point, by causing one or more of the stations to disassociate from a current access point and to reassociate with the common access point. In an aspect, the identity of the common access point may be independently derived at each terminal station using simple broadcast messaging procedures, without the need for extensive communications or handshaking between the terminal stations. In an alternative aspect, the identity of the common AP need not be known a priori, and a terminal station may repeat the disassociation and reassociation procedures until a measured latency with a paired terminal station drops below a maximum latency threshold.

The detailed description set forth below in connection with the appended drawings is intended as a description of exemplary means “serving as an example, instance, or illustration,” and should not necessarily be construed as preferred or advantageous over other exemplary aspects. The detailed description includes specific details for the purpose of providing a thorough understanding of the exemplary aspects of the invention. It will be apparent to those skilled in the art that the exemplary aspects of the invention may be practiced without these specific details. In some instances, well-known structures and devices are shown in block diagram form in order to avoid obscuring the novelty of the exemplary aspects presented herein.

FIG. 1 shows an illustrative configuration 100 of a wireless local area network (herein “WLAN”) illustrating various aspects of the present disclosure. Note FIG. 1 is not meant to limit the scope of the present disclosure to any particular network types, topologies, numbers of access points or stations, etc.

In FIG. 1, the WLAN may service a plurality of wireless devices or terminal stations (herein “STA's”) within its coverage area. In exemplary implementations, an STA may correspond to any wireless device, e.g., mobile wireless devices such as smartphones or laptop computers, or other wireless devices such as desktop computers, wireless displays, etc.

The WLAN has a network name or service set identifier (herein “SSID”), illustratively denoted SSID-1. In an exemplary implementation, an SSID may be defined as according to the IEEE 802.11 Wireless Local Area Network Specifications (herein “802.11”), also known as “Wi-Fi.” While certain exemplary instances of a WLAN are described herein with reference to 802.11, it will be appreciated that techniques of the present disclosure are readily applicable to other wireless standards or specifications, and such alternative exemplary implementations are contemplated to be within the scope of the present disclosure.

For ease of illustration, only one WLAN is shown in FIG. 1, while, generally, a single STA may be within the coverage area of multiple WLAN's. Of such WLAN's, an STA may be configured to access only authorized or trusted networks or SSID's, e.g., using authentication and/or encryption keys where necessary.

In a mode of WLAN operation known as “infrastructure mode,” the WLAN may include a plurality of servers or access points (herein “AP's”), such as AP-1 and AP-2 shown in FIG. 1. In an exemplary implementation, an AP may correspond to a wireless router configured to provide wireless service to STA's located within the AP's spatial coverage area. For example, in FIG. 1, STA-1 is coupled by wireless connection 120.1 to AP-1, and STA-2 is coupled by wireless connection 120.2 to AP-2.

AP-1 and AP-2 are coupled to each other using a wired or wireless connection 105, which may correspond to, e.g., a wired or cabled local area network (herein “LAN”) connection. Connection 105 may further be coupled to a wide area network (herein “WAN”), e.g., enabling access to the Internet by all members of the WLAN.

An AP and any STA's serviced by that AP collectively constitute a logical entity known as a basic service set (herein “BSS”), and each BSS may have a unique identifier known as a basic service set identifier (herein “BSSID”). For example, in FIG. 1, AP-1, STA-1 and STA-3 are associated with BSSID=1, while AP-2 and STA-2 are associated with BSSID=2. Note all STA's in FIG. 1 are associated with a single SSID (e.g., SSID-1), and hence are denoted intra-network STA's herein.

It will be appreciated that the infrastructure mode of operation advantageously enables seamless connectivity, such that a mobile STA may be sequentially serviced by different AP's while staying connected to the same SSID. For example, in FIG. 1, STA-1 is shown as being serviced by AP-1 through wireless connection 120.1. However, if STA-1 moves outside the range 110.1 of AP-1, while staying in range 110.2 of AP-2, then STA-1 may “disassociate” from AP-1 and subsequently “reassociate” with AP-2. The process of disassociation and reassociation may proceed as defined in 802.11, e.g., by invoking disassociation and reassociation services in the distribution system service (DSS).

In certain applications, any two intra-network STA's (herein “paired STA's”), illustratively denoted STA-1 and STA-2 in FIG. 1, may wirelessly communicate with each other in infrastructure mode according to a procedure such as procedure 200 in FIG. 2, described hereinbelow. Note procedure 200 is shown for illustrative purposes only, and is not meant to limit the scope of the present disclosure to any particular types of connections between paired STA's and AP's of the network.

In FIG. 2, at block 210, STA-1 wirelessly transmits data to AP-1, with which it is associated. At block 220, AP-1 transmits the data received from STA-1 to AP-2, e.g., over connection 105. At block 230, AP-2 wirelessly transmits the data to STA-2, which is associated with AP-2. It will be appreciated that network traffic in the opposite direction, e.g., from STA-2 to STA-1, may be analogously conducted.

From FIGS. 1 and 2, it will be appreciated that the relaying of data between AP-1 and AP-2 at block 220 introduces a latency to wireless communications between paired STA's STA-1 and STA-2, even if STA-1 and STA-2 are in close physical proximity to each other. This latency may critically degrade performance for certain types of audio and/or video streaming systems, wherein data transfers are heavy and need to have low latency. For example, such systems may include wireless display applications implemented according to the Miracast standard, wherein a Miracast source (e.g., STA-1) is paired with a Miracast sink (e.g., STA-2).

It would be desirable to provide techniques to minimize latency when wirelessly transferring data between paired intra-network STA's in WLAN infrastructure mode.

FIG. 3 illustrates an exemplary implementation of a method 300 according to the present disclosure, and FIG. 4 shows an exemplary configuration 400 during the connection procedure of method 300. Note FIGS. 3 and 4 are shown for illustrative purposes only, and are not meant to limit the scope of the present disclosure. For example, the figures are not meant to limit the number of SSID's, AP's, STA's, or BSS's present in any system wherein the present techniques are implemented.

In FIG. 3, at block 310, for paired STA's (e.g., STA-1 and STA-2), it is determined whether they share a common SSID but have different BSSID's. For example, this may correspond to a scenario such as illustrated in FIG. 1, wherein STA-1 and STA-2 are both associated with SSID-1, but STA-1 is associated with BSSID=1, and STA-2 is associated with BSSID=2. If the determination is TRUE, then method 300 proceeds to block 315.

In an exemplary implementation, the determination at block 310 may be performed in a decentralized, peer-to-peer manner at each STA, e.g., without requiring a third entity other than the paired STA's. For example, paired STA's may wirelessly broadcast their SSID's/BSSID's to each other (and any other intra-network STA's within range) via point-to-point communications, e.g., without passing data through their AP's. In an alternative exemplary implementation, either or both STA's may broadcast its information to other intra-network STA's, e.g., by employing a higher-layer broadcast procedure in which an STA wirelessly transmits its BSSID to its AP, which in turn relays the information to other intra-network STA's, etc. In yet another exemplary implementation, e.g., as illustrated and described with reference to FIG. 12 hereinbelow, neither STA needs to know the BSSID of the other STA prior to performing the disassociation and reassociation procedures described hereinbelow.

At block 315, it is determined whether the paired STA's are within a minimum distance (Dmin) of each other. In an exemplary implementation, each STA may utilize a local device geolocation (e.g., GPS or global positioning system) module to determine its own current spatial position, and communicate its position to the other STA, e.g., using the peer-to-peer communication techniques described hereinabove with reference to block 310. In an alternative exemplary implementation, the determination at block 315 may also be performed by each STA measuring the received signal strength of the other STA of the pair, and using the received signal strength as a proxy for the distance between the two STA's.

It will be appreciated that in alternative exemplary implementations, blocks 310, 315 may be reversed in sequence, or executed in parallel, etc.

At block 317, one of the paired STA's checks whether it is in range of the AP associated with the other STA. For example, STA-2 may broadcast an 802.11 probe request to solicit responses from access points within range of the wireless client. It will be appreciated that, given the determination that STA-1 and STA-2 are within a minimum distance of each other as determined at block 315, the probability of AP-1 being in range of STA-2 is high.

At block 320, STA-2 disassociates from AP-2. For example, STA-2 may issue 802.11 disassociation frames to AP-2 to initiate the process of disassociation. Further at block 320, the disassociated STA subsequently reassociates with AP-1. Following reassociation, both STA-1 and STA-2 are associated with AP-1, also denoted herein the “common AP.”

FIG. 4 shows an exemplary configuration 400 of the WLAN following execution of block 320. In particular, STA-2, having disassociated from AP-2, reassociates with AP-1, the common AP, via wireless connection 420.2. Subsequent to block 320, both STA-1 and STA-2 share a common BSSID.

Note STA-2 specifically disassociates from AP-2 at block 320, even though STA-2 may still be within range of AP-2, and/or even if AP-2 in fact affords the strongest wireless signal to STA-2 at the time. This may contrast with typical disassociation/reassociation procedures, e.g., such as may be performed in response to an STA moving out of range of an AP with which it is currently associated. In an exemplary implementation of the present disclosure, STA-2 may further be configured to prevent reassociation with AP-2 during execution of method 300, even if AP-2 is within range.

At block 330, STA-1 transmits data via AP-1 to STA-2. STA-2 may also or alternatively transmit data via AP-1 to STA-1. As there is no longer inter-AP data transmission as per block 220 of procedure 200, it will be appreciated that the latency accompanying such inter-AP transmission is advantageously eliminated.

To implement method 300, it will be appreciated that the paired STA's should be within range of a common AP, e.g., AP-1 in FIG. 4. In alternative exemplary implementations, the aforementioned techniques may also be applied if neither STA is presently connected to the common AP, and/or when the paired STA's are separated by more than the minimum distance Dmin, as described hereinbelow.

FIG. 5 illustrates an alternative initial WLAN configuration 500, with paired STA's STA-1 and STA-2 associated with SSID-2. In FIG. 5, STA-1 is associated with AP-1, and STA-2 with AP-2. However, neither AP-1 nor AP-2 is suitable for use as a common AP, since each is out of range of either STA-1 or STA-2. Furthermore, STA-1 and STA-2 are separated by more than the minimum distance Dmin.

FIG. 6 illustrates an alternative exemplary implementation 600 of a method for associating the paired STA's with a third AP functioning as the common AP.

In FIG. 6, at block 610, for paired STA's STA-1 and STA-2, it is determined whether they share a common SSID but different BSSID's. For example, this may correspond to WLAN configuration 500 illustrated in FIG. 5, wherein STA-1 and STA-2 are both associated with SSID-2, but STA-1 is associated with BSSID=1 and STA-2 is associated with BSSID=2. If the determination is TRUE, then method 600 proceeds to block 615.

At block 615, it is determined whether the paired STA's are within a minimum distance from each other, or whether a currently associated AP (e.g., AP-1) is within range of both the paired STA's. If this is TRUE, then method 600 proceeds to block 617 to execute block 320 of method 300, e.g., as described hereinabove with reference to FIG. 3. If FALSE, then method 600 proceeds to block 620. In particular, if the WLAN configuration is such that only one STA needs to disassociate and reassociate, then method 300 may be executed.

At block 620, paired STA's STA-1 and STA-2 communicate to each other a list of BSSID's within range of each STA. For 10 example, AvailBSSID-1, AvailBSSID-2 may represent lists of BSSID's within range of STA-1, STA-2, respectively. In an exemplary implementation, each list may rank BSSID's in order of received signal strength, and/or may include indicators of the actual received signal strengths of each BSSID. The communications may be performed in a peer-to-peer manner, or over the wireless infrastructure.

At block 630, STA-1 and STA-2 compute a common BSSID based on the received lists AvailBSSID-1, AvailBSSID-2. In an exemplary implementation, the paired STA's may independently agree on a common BSSID given the received lists AvailBSSID-1, AvailBSSID-2, i.e., without exchanging further information between themselves. For example, the common BSSID may be chosen to correspond to the AP received with the highest sum of received signal strengths (e.g., received signal strength at STA-1 plus received signal strength at STA-2, etc.) by both terminal stations, or using other joint metrics. One of ordinary skill in the art will appreciate that any of a variety of techniques may be employed to choose a common BSSID under these conditions, and such alternative exemplary implementations are contemplated to be within the scope of the present disclosure.

At block 640, STA-1 and STA-2 disassociate from their current AP's, and reassociate with the common AP as computed at block 630. FIG. 7 shows an exemplary configuration 700 of the WLAN following block 640 of method 600. In particular, STA-1 and STA-2, having disassociated from their respective previous AP's AP-1 and AP2, are both reassociated with the common AP AP-3.

At block 650, data is exchanged between the paired STA's through the common AP.

FIG. 8 illustrates an alternative exemplary implementation of a method 800, wherein the determination at block 310 of FIG. 3 is omitted. In particular, an STA that disassociates and reassociates (herein “roaming STA”) need not know the BSSID of the other paired STA prior to reassociation, and may simply repeat the process of disassociation and reassociation with various AP's within range until a connection of sufficiently low latency with the other paired STA is established.

In FIG. 8, at block 810, an STA determines the latency in communications with a paired STA. One of ordinary skill in the art will appreciate that such determination may be made using various techniques, e.g., comparing a timestamp of a transmitted data packet with the current time, etc.

At block 820, it is determined whether the measured latency at block 810 is greater than max_latency, or a maximum latency threshold deemed acceptable in the system. If FALSE, then method 800 proceeds to block 840, wherein ordinary communications are conducted between the paired STA's using the current AP. If TRUE, then method 800 proceeds to block 830.

At block 830, the roaming STA disassociates from the current AP, and reassociates with a new AP. In an exemplary implementation, the new AP may correspond to, e.g., an AP with which the roaming STA has not yet been associated during a current communications session with its paired STA. Following reassociation with a new AP, the method 800 proceeds back to block 810.

In an alternative exemplary implementation (not shown), method 800 may further include, prior to disassociating from the current AP, verifying that the second terminal station is within a minimum distance of the first terminal station.

It will be appreciated that, according to method 800, STA-2 (the roaming STA) may be caused to disassociate from AP-2 in configuration 100 of FIG. 1, and subsequently reassociate with AP-1. In this case, the roaming STA may reassociate with other AP's within range (not shown in FIG. 1), prior to establishing connection 420.2 with AP-1 that has low latency. Alternatively, in configuration 500 of FIG. 5, both STA-1 and STA-2 may simultaneously execute method 800, eventually resulting in both paired STA's reassociating with AP-3 for low-latency communications.

FIG. 9 illustrates an exemplary implementation 900 of paired STA's associated with a common AP 910, wherein STA-1 is a wireless content device 920, and STA-2 is a wireless display 930 configured to display content received from wireless content device 920. In an exemplary implementation, the paired STA's may be connected to common AP 910 as a result of, e.g., executing either method 300, method 600, or method 900. Note wireless content device 920 may support an alternative wireless connection 920 a to a WAN (not shown), e.g., a 4G network, in addition to wireless connection 920 b to AP 910.

FIG. 10 illustrates a method 1000 for use by a first terminal station in a wireless local area network (WLAN), the method comprising: at block 1010, while being associated with a first access point (AP) of the WLAN having a first basic service set identity (BSSID), receiving an indication of a second BSSID of a second access point associated with a second terminal station in the WLAN; at block 1020, in response to determining the second BSSID being distinct from the first BSSID, verifying that the second AP is within range of the first terminal station; at block 1030, disassociating from the first AP; at block 1040, reassociating with the second AP; and at block 1050, communicating with the second terminal station via infrastructure mode of the WLAN.

FIG. 11 illustrates an apparatus 1100 comprising: a wireless radio 1110 comprising a receiver and a transmitter for wirelessly communicating with a wireless local area network (WLAN) as a first terminal station; a processor 1120 coupled to the wireless radio to generate data for the transmitter and to receive data from the receiver; a memory 1130 coupled to the processor, the memory storing instructions operable to cause the processor to execute steps comprising: while being associated with a first access point (AP) of the WLAN having a first basic service set identity (BSSID), receiving an indication of a second BSSID of a second access point associated with a second terminal station in the WLAN; in response to determining the second BSSID being distinct from the first BSSID, verifying that the second AP is within range of the first terminal station; disassociating from the first AP; and reassociating with the second AP; and using the wireless radio, communicating with the second AP via infrastructure mode of the WLAN.

FIG. 12 illustrates an apparatus 1200 comprising: means 1210 for, while being associated with a first access point (AP) of the WLAN having a first basic service set identity (BSSID), receiving an indication of a second BSSID of a second access point associated with a second terminal station in the WLAN; means 1220 for, in response to determining the second BSSID being distinct from the first BSSID, verifying that the second AP is within range of the first terminal station; means 1230 for disassociating from the first AP and reassociating with the second AP; and means 1240 for communicating with the second AP via infrastructure mode of the WLAN. In an exemplary implementation, such means may correspond to, e.g., any hardware or software logical modules configured to perform the functions recited.

In this specification and in the claims, it will be understood that when an element is referred to as being “connected to” or “coupled to” another element, it can be directly connected or coupled to the other element or intervening elements may be present. In contrast, when an element is referred to as being “directly connected to” or “directly coupled to” another element, there are no intervening elements present. Furthermore, when an element is referred to as being “electrically coupled” to another element, it denotes that a path of low resistance is present between such elements, while when an element is referred to as being simply “coupled” to another element, there may or may not be a path of low resistance between such elements.

The functionality described herein can be performed, at least in part, by one or more hardware and/or software logic components. For example, and without limitation, illustrative types of hardware logic components that can be used include Field-programmable Gate Arrays (FPGAs), Program-specific Integrated Circuits (ASICs), Program-specific Standard Products (ASSPs), System-on-a-chip systems (SOCs), Complex Programmable Logic Devices (CPLDs), etc.

While the invention is susceptible to various modifications and alternative constructions, certain illustrated implementations thereof are shown in the drawings and have been described above in detail. It should be understood, however, that there is no intention to limit the invention to the specific forms disclosed, but on the contrary, the intention is to cover all modifications, alternative constructions, and equivalents falling within the spirit and scope of the invention. 

The invention claimed is:
 1. An apparatus comprising: one or more processors; and a memory storing instructions that, when executed by the one or more processors, cause the one or more processors to perform the following operations: determining that a first terminal station (STA) in a wireless local area network (WLAN) is communicatively coupled with a first access point (AP) corresponding to a first basic service set identity (BSSID) and a first service set identifier (SSID); determining that a second STA in the WLAN is associated with a second AP corresponding to a second BSSID and the first SSID; identifying, from a set of BSSIDs determined to be within range of both the first STA and the second STA, a common BSSID associated with the first SSID; in accordance with identifying the common BSSID: disassociating the first STA and the second STA from the first AP and the second AP; and associating the first STA and the second STA with a third AP that corresponds to the common BSSID; and communicating data between the first STA and the second STA through the third AP.
 2. The apparatus of claim 1, wherein the memory further comprises instructions that, when executed by the one or more processors, cause the one or more processors to receive a broadcast message from the first STA or the first AP that the first STA is associated with the first AP and the first BSSID.
 3. The apparatus of claim 1, wherein the memory further comprises instructions that, when executed by the one or more processors, cause the one or more processors to receive a broadcast message from the second STA or the second AP that the second STA is associated with the second AP and the second BSSID.
 4. The apparatus of claim 1, wherein the memory further comprises instructions that, when executed by the one or more processors, cause the one or more processors to, after disassociating the first STA and the second STA from the first AP and the second AP, preventing the first STA and the second STA from reassociating with the first AP.
 5. The apparatus of claim 1, wherein identifying the common BSSID comprises selecting a BSSID that maximizes a sum of received signal power at the first terminal station and received signal power at the second STA.
 6. The apparatus of claim 1, wherein the memory further comprises instructions that, when executed by the one or more processors, cause the one or more processors to, in response to determining the second BSSID is distinct from the first BSSID, verifying that the first STA is not within a minimal distance from the second STA or that the first AP is not within a range of the second AP.
 7. The apparatus of claim 6, wherein the verifying comprises: receiving an indication of a location of the first STA and the second STA; and determining that the location of the second STA is not within the minimum distance of the location of the first STA.
 8. A method comprising: determining that a first terminal station (STA) in a wireless local area network (WLAN) is communicatively coupled with a first access point (AP) corresponding to a first basic service set identity (BSSID) and a first service set identifier (SSID); determining that a second STA in the WLAN is associated with a second AP corresponding to a second BSSID and the first SSID; identifying, from a set of BSSIDs determined to be within range of both the first STA and the second STA, a common BSSID associated with the first SSID; in accordance with identifying the common BSSID: disassociating the first STA and the second STA from the first AP and the second AP; and associating the first STA and the second STA with a third AP that corresponds to the common BSSID; and communicating data between the first STA and the second STA through the third AP.
 9. The method of claim 8, further comprising receiving a broadcast message from the first STA or the first AP that the first STA is associated with the first AP and the first BSSID.
 10. The method of claim 8, further comprising receiving a broadcast message from the second STA or the second AP that the second STA is associated with the second AP and the second BSSID.
 11. The method of claim 8, further comprising after disassociating the first STA and the second STA from the first AP and the second AP, preventing the first STA and the second STA from reassociating with the first AP.
 12. The method of claim 8, wherein identifying the common BSSID comprises selecting a BSSID that maximizes a sum of received signal power at the first terminal station and received signal power at the second STA.
 13. The method of claim 8, further comprising, in response to determining the second BSSID is distinct from the first BSSID, verifying that the first STA is not within a minimal distance from the second STA or that the first AP is not within a range of the second AP.
 14. The method of claim 13, wherein the verifying comprises: receiving an indication of a location of the first STA and the second STA; and determining that the location of the second STA is not within the minimum distance of the location of the first STA.
 15. One or more computer-readable storage devices comprising computer-executable instructions that, when executed by one or more processors, cause the one or more processors to perform the following operations: determining that a first terminal station (STA) in a wireless local area network (WLAN) is communicatively coupled with a first access point (AP) corresponding to a first basic service set identity (BSSID) and a first service set identifier (SSID); determining that a second STA in the WLAN is associated with a second AP corresponding to a second BSSID and the first SSID; identifying, from a set of BSSIDs determined to be within range of both the first STA and the second STA, a common BSSID associated with the first SSID; in accordance with identifying the common BSSID: disassociating the first STA and the second STA from the first AP and the second AP; and associating the first STA and the second STA with a third AP that corresponds to the common BSSID; and communicating data between the first STA and the second STA through the third AP.
 16. The one or more computer-readable storage devices of claim 15, wherein the computer-executable instructions further cause the one or more processors to receive a broadcast message from the first STA or the first AP that the first STA is associated with the first AP and the first BSSID.
 17. The one or more computer-readable storage devices of claim 15, wherein the computer-executable instructions further cause the one or more processors to receive a broadcast message from the second STA or the second AP that the second STA is associated with the second AP and the second BSSID.
 18. The one or more computer-readable storage devices of claim 15, wherein the computer-executable instructions further cause the one or more processors to, after disassociating the first STA and the second STA from the first AP and the second AP, preventing the first STA and the second STA from reassociating with the first AP.
 19. The one or more computer-readable storage devices of claim 15, wherein identifying the common BSSID comprises selecting a BSSID that maximizes a sum of received signal power at the first terminal station and received signal power at the second STA.
 20. The one or more computer-readable storage devices of claim 15, wherein the computer-executable instructions further cause the one or more processors to, in response to determining the second BSSID is distinct from the first BSSID, verifying that the first STA is not within a minimal distance from the second STA or that the first AP is not within a range of the second AP. 